Algorithms for Reconstructing Phylogenetic Trees from Dissimilarity Maps
نویسندگان
چکیده
In this paper we improve on an algorithm by Pachter-Speyer for reconstruction of a phylogenetic tree from its size-m subtree weights. We provide an especially efficient algorithm for reconstruction from 3-weights.
منابع مشابه
Quartet consistency count method for reconstructing phylogenetic trees
Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualita...
متن کاملThe Split Decomposition of a k-Dissimilarity Map
A k-dissimilarity map on a finite set X is a function D : ( X k ) → R assigning a real value to each subset of X with cardinality k, k ≥ 2. Such functions, also sometimes known as k-way dissimilarities, k-way distances, or k-semimetrics, are of interest in many areas of mathematics, computer science and classification theory, especially 2-dissimilarity maps (or distances) which are a generalisa...
متن کاملDissimilarity Maps on Trees and the Representation Theory of GLn(ℂ)
We revisit representation theory in type A, used previously to establish that the dissimilarity vectors of phylogenetic trees are points on the tropical Grassmannian variety. We use a different version of this construction to show that the space of phylogenetic trees Kn maps to the tropical varieties of every flag variety of GLn(C). Using this map, we find a tropical function on the space of ph...
متن کاملAlgorithms for Computing Cluster Dissimilarity between Rooted Phyloge- netic Trees
Phylogenetic trees represent the historical evolutionary relationships between different species or organisms. Creating and maintaining a repository of phylogenetic trees is one of the major objectives of molecular evolution studies. One way of mining phylogenetic information databases would be to compare the trees by using a tree comparison measure. Presented here are a new dissimilarity measu...
متن کاملAffine and projective tree metric theorems
The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A related weaker four point condition characterizes dissimilarity maps derived from circular split systems known as Kalmanson metrics. The tree metric theorem was first discovered in the context of phylogenetics and forms the basis of many t...
متن کامل